Large packet concatenation in satellite communication system

ABSTRACT

Upstream information arriving through a gateway from a user terminal in a satellite link subject to propagation delay is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that arriving data packets arriving at the software queue at the user terminal are concatenated to form a large frame for transmission to improve efficiency. A piggyback request replacing a conventional DAMA contention request for the succeeding packet is issued to request bandwidth allocation for the succeeding concatenated packet. In a specific embodiment, all packets up to the physical request limit arriving at the user terminal since a prior piggyback request or contention request are concatenated so that all currently known packets (up to that limit) are accounted for by the next piggyback request.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of International Application No. PCT/US2007/079565 filed Sep. 26, 2007, which claimed benefit of provisional Patent Application Ser. No. 60/828,033 filed Oct. 3, 2006. The following U.S. provisional and continuation-in-part patent applications, including the above referenced provisional application, were filed concurrently with the provisional application from which benefit is claimed under 35 U.S.C. 119(e), and the disclosure of every other application is incorporated by reference in the present application in its entirety for all purposes:

-   -   U.S. Provisional Patent Application No. 60/828,033, filed Oct.         3, 2006 “Large Packet Concatenation In Satellite Communication         System” (Attorney Docket No. 017018-008200US);     -   U.S. Provisional Patent Application No. 60/827,960, filed Oct.         3, 2006 for “Adaptive Use Of Satellite Uplink Bands” (Attorney         Docket No. 017018-008000US);     -   U.S. Provisional Patent Application No. 60/827,927, filed Oct.         3, 2006 for “Frequency Re-Use For Service And Gateway Beams”         (Attorney Docket No. 017018-008300US);     -   U.S. Provisional Patent Application No. 60/827,959, filed Oct.         3, 2006 for “Satellite Architecture” (Attorney Docket No.         017018-008500US);     -   U.S. Provisional Patent Application No. 60/827,960, filed Oct.         3, 2006 for “Piggy-Back Satellite Architecture” (Attorney Docket         No. 017018-008600US);     -   U.S. Provisional Patent Application No. 60/827,964, filed Oct.         3, 2006 for “Placement Of Gateways Away From Service Beams”         (Attorney Docket No. 017018-008800US)     -   U.S. Provisional Patent Application No. 60/828,021, filed Oct.         3, 2006 for “Multi-Service Provider Subscriber Authentication”         (Attorney Docket No. 017018-007700US);     -   U.S. Provisional Patent Application No. 60/828,037, filed Oct.         3, 2006 “Upfront Delayed Concatenation In Satellite         Communication System” (Attorney Docket No. 017018-010500US);     -   U.S. Provisional Patent Application No. 60/828,014, filed Oct.         3, 2006 for “Map-Trigger Dump Of Packets In Satellite         Communication System” (Attorney Docket No. 017018-010600US);     -   U.S. Provisional Patent Application No. 60/828,044, filed Oct.         3, 2006 for “Web/Bulk Transfer Preallocation Of Upstream         Resources In A Satellite Communication System” (Attorney Docket         No. 017018-010700US);     -   U.S. Continuation in Part patent application Ser. No.         11/538,431, filed Oct. 3, 2006 for “Code Reuse Multiple Access         For A Satellite Return Link” (Attorney Docket No.         017018-001212US);     -   U.S. Continuation in Part patent application Ser. No.         11/538,429, filed Oct. 3, 2006 for “Method For Congestion         Management” (Attorney Docket No. 017018-00611US);     -   U.S. Provisional Patent Application No. 60/827,985, filed Oct.         3, 2006 for “Aggregate Rate Modem” (Attorney Docket No.         017018-008900US);     -   U.S. Provisional Patent Application No. 60/827,988, filed Oct.         3, 2006 for “Packet Reformatting For Downstream Links” (Attorney         Docket No. 017018-009000US);     -   U.S. Provisional Patent Application No. 60/827,992, filed Oct.         3, 2006 for “Downstream Waveform Modification” (Attorney Docket         No. 017018-009100US);     -   U.S. Provisional Patent Application No. 60/827,994, filed Oct.         3, 2006 for “Upstream Resource Optimization” (Attorney Docket         No. 017018-009200US);     -   U.S. Provisional Patent Application No. 60/827,999, filed Oct.         3, 2006 for “Upstream MF-TDMA Frequency Hopping” (Attorney         Docket No. 017018-009300US);     -   U.S. Provisional Patent Application No. 60/828,002, filed Oct.         3, 2006 for “Downstream Virtual Channels Multiplexed On A Per         Symbol Basis” (Attorney Docket No. 017018-009400US);     -   U.S. Provisional Patent Application No. 60/827,997, filed Oct.         3, 2006 for “Modified Downstream Waveform” (Attorney Docket No.         017018-010800US);     -   U.S. Provisional Patent Application No. 60/828,038, filed Oct.         3, 2006 for “Adapted DOCSIS Circuit For Satellite Media”         (Attorney Docket No. 017018-009500US);     -   U.S. Provisional Patent Application No. 60/828,045, filed Oct.         3, 2006 for “Satellite Downstream Virtual Channels” (Attorney         Docket No. 017018-009700US);     -   U.S. Provisional Patent Application No. 60/828,035, filed Oct.         3, 2006 for “Satellite Broadband With Less Than One Country Of         Coverage” (Attorney Docket No. 017018-010300US);     -   U.S. Provisional Patent Application No. 60/828,032, filed Oct.         3, 2006 for “Multi-User Detection In Satellite Return Link”         (Attorney Docket No. 017018-010100US);     -   U.S. Provisional Patent Application No. 60/828,034, filed Oct.         3, 2006 for “Multi-Rate Downstreaming In Multiple Virtual         Channel Environment” (Attorney Docket No. 017018-010200US);     -   U.S. Provisional Patent Application No. 60/828,047, filed Oct.         3, 2006 for “Satellite Upstream Load Balancing” (Attorney Docket         No. 017018-009900US);     -   U.S. Provisional Patent Application No. 60/828,048, filed Oct.         3, 2006 for “Satellite Upstream/Downstream Virtual Channel         Architecture” (Attorney Docket No. 017018-010000US); and     -   U.S. Provisional Patent Application No. 60/828,046, filed Oct.         3, 2006 for “Virtual Downstream Channel Load Balancing”         (Attorney Docket No. 017018-009800US).

FIELD OF THE INVENTION

The present invention relates to wireless communications in general and, in particular, to a satellite communications network.

BACKGROUND OF THE INVENTION

Consumer broadband satellite services are gaining traction in North America with the start up of star network services using Ka band satellites. While such first generation satellite systems may provide multi-gigabit per second (Gbps) per satellite overall capacity, the design of such systems inherently limits the number of customers that may be adequately served. Moreover, the fact that the capacity is split across numerous coverage areas further limits the bandwidth to each subscriber.

While existing designs have a number of capacity limitations, the demand for such broadband services continues to grow. The past few years have seen strong advances in communications and processing technology. This technology, in conjunction with selected innovative system and component design, may be harnessed to produce a novel satellite communications system to address this demand.

DAMA Basics

A DAMA user terminal, also known as a user satellite modem (SM), is operative to transmit a request to the DAMA scheduler at the gateway, or SMTS, requesting upstream bandwidth sufficient to transmit the data that is in its output queue. Ignoring the contention delay (i.e. the delay to contend for, possibly collide in, and finally successfully transmit in the contention channel), the arriving packet must wait a handshake interval until bandwidth is assigned. The handshake interval is the round trip time between the terminal and the central controller (in the present case the SMTS), denoted RTT. The terminal will then transmit the packet and, ignoring the transmit time, the packet will arrive at the central controller one half an RTT later. This process implies that all packets arriving to an empty output queue will experience a delay of 1.5×RTT, not counting the contention delay. This delay of 1.5×RTT is an irreducible lower bound.

Because packets that arrive to a non empty queue must wait until they move to the head of the queue, these packets will experience a total delay greater than 1.5×RTT. Their delay is their wait time plus 1.5×RTT. The DAMA scheduler attempts to minimize the wait time of packets that arrive to a non-empty queue.

DOCSIS Best Effort DAMA (BE-DAMA) is pure DAMA with the sole exception that requests for bandwidth can be piggybacked on transmitted data packets so as to take some of the loading off the contention channel, and hence increase overall system capacity. This means that a burst of packets arriving at a DOCSIS cable modem (CM) will have only one contention delay for the entire burst. The piggybacked request mechanism limits the request to just describe the packet in position 1 in the output queue (the packet being transmitted occupies position 0 in the output queue). This implies that the first packet of a burst (p0) will have a delay of 1.5×RTT, packet 1 will have a delay of up to 2.5×RTT, packet 2 will have a delay of up to 3.5×RTT, and so on.

A Demand Assigned Multiple Access (DAMA) scheduler is useful for relieving some of the load in a channel subject to contention. The goal of a DAMA scheduler in this instance is to reduce the number of assigned-but-unused minislots on the upstream channel (i.e. improve scheduling efficiency) without degrading webpage-download or FTP upload performance which uses the downstream channels. The ultimate goal is to provide more available upstream bandwidth to support more subscribers per upstream. By the nature of burst transmission of packets, a burst of packets can have only one contention delay for the entire burst. However, DAMA produces collisions in the contention channel since the arrival of packets is not deterministic, thus producing undesired latency and inefficiency in channel usage. To improve efficiency, what is needed is a mechanism to reduce the wait time. DAMA is a potential tool in a mechanism to this end.

CONCISE EXPLANATION OF THE INVENTION

According to the invention, upstream information arriving through a gateway from a user terminal in a satellite link subject to propagation delay is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that arriving data packets arriving at the software queue at the user terminal are concatenated to form a large frame for transmission to improve efficiency. A piggyback request replacing a conventional DAMA contention request for the succeeding packet is issued to request bandwidth for the succeeding concatenated packet. In a specific embodiment, all packets up to the physical request limit arriving at the user terminal since a prior piggyback request or contention request are concatenated so that all currently known packets (up to that limit) are accounted for by the next piggyback request.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A and 1B are block diagrams of a satellite communication system

FIGS. 2A and 2B are maps showing geographical distributions of beams.

FIG. 3 is a block diagram of a gateway system.

FIG. 4 is a block diagram of a control system.

FIG. 5 is a block diagram of communication and control elements of a satellite relay.

FIGS. 6A and 6B are block diagrams of upstream and downstream translators of FIG. 5.

FIG. 7 is a block diagram of a subscriber facility with a subscriber terminal.

FIG. 8 is a timing diagram of a forward channel superframe.

FIG. 9 is a timing diagram of a typical return channel superframe.

FIG. 10 is a block diagram of a gateway transmitter.

FIG. 11 is a block diagram of a gateway receiver.

FIGS. 12A and 12B are diagrams illustrating frequency allocation of a gateway.

FIG. 13 is a block diagram of a forward channel and return channels in a relay satellite.

FIG. 14 is a diagram of a state machine with detailed explanations according to the invention.

FIGS. 15A, 15B, 15C together form a flow chart according to the invention.

DETAILED DESCRIPTION OF THE INVENTION

Various embodiments of the present invention comprise systems, methods, devices, and software for a novel broadband satellite network. This description provides exemplary embodiments only, and is not intended to limit the scope, applicability or configuration of the invention. Rather, the ensuing description of the embodiments will provide those skilled in the art with an enabling description for implementing embodiments of the invention. Various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the invention.

Thus, various embodiments may omit, substitute, or add various procedures or components as appropriate. For instance, it should be appreciated that in alternative embodiments, the methods may be performed in an order different than that described, and that various steps may be added, omitted or combined. Also, features described with respect to certain embodiments may be combined in various other embodiments. Different aspects and elements of the embodiments may be combined in a similar manner. Also, a number of steps may be required before, after, or concurrently with the following embodiments.

It should also be appreciated that the following systems, methods, devices, and software may be a component of a larger system, wherein other procedures may take precedence over or otherwise modify their application.

FIG. 1A is a block diagram of an exemplary satellite communications system 100 configured according to various embodiments of the invention. The satellite communications system 100 includes a network 120, such as the Internet, interfaced with a gateway 115 that is configured to communicate with one or more subscriber terminals 130, via a satellite 105. A gateway 115 is sometimes referred to as a hub or ground station. Subscriber terminals 130 are sometimes called modems, satellite modems or user terminals. As noted above, although the communications system 100 is illustrated as a geostationary satellite 105 based communication system, it should be noted that various embodiments described herein are not limited to use in geostationary satellite based systems, for example some embodiments could be low earth orbit (LEO) satellite based systems.

The network 120 may be any type of network and can include, for example, the Internet, an IP network, an intranet, a wide-area network (“WAN”), a local-area network (“LAN”), a virtual private network, the Public Switched Telephone Network (“PSTN”), and/or any other type of network supporting data communication between devices described herein, in different embodiments. A network 120 may include both wired and wireless connections, including optical links. Many other examples are possible and apparent to those skilled in the art in light of this disclosure. As illustrated in a number of embodiments, the network may connect the gateway 115 with other gateways (not pictured), which are also in communication with the satellite 105.

The gateway 115 provides an interface between the network 120 and the satellite 105. The gateway 115 may be configured to receive data and information directed to one or more subscriber terminals 130, and can format the data and information for delivery to the respective destination device via the satellite 105. Similarly, the gateway 115 may be configured to receive signals from the satellite 105 (e.g., from one or more subscriber terminals) directed to a destination in the network 120, and can format the received signals for transmission along the network 120.

A device (not shown) connected to the network 120 may communicate with one or more subscriber terminals, and through the gateway 115. Data and information, for example IP datagrams, may be sent from a device in the network 120 to the gateway 115. The gateway 115 may format a Medium Access Control (MAC) frame in accordance with a physical layer definition for transmission to the satellite 130. A variety of physical layer transmission modulation and coding techniques may be used with certain embodiments of the invention, including those defined with the DVB-S2 and WiMAX standards. The link 135 from the gateway 115 to the satellite 105 may be referred to hereinafter as the downstream uplink 135.

The gateway 115 may use an antenna 110 to transmit the signal to the satellite 105. In one embodiment, the antenna 110 comprises a parabolic reflector with high directivity in the direction of the satellite and low directivity in other directions. The antenna 110 may comprise a variety of alternative configurations and include operating features such as high isolation between orthogonal polarizations, high efficiency in the operational frequency bands, and low noise.

In one embodiment, a geostationary satellite 105 is configured to receive the signals from the location of antenna 110 and within the frequency band and specific polarization transmitted. The satellite 105 may, for example, use a reflector antenna, lens antenna, array antenna, active antenna, or other mechanism known in the art for reception of such signals. The satellite 105 may process the signals received from the gateway 115 and forward the signal from the gateway 115 containing the MAC frame to one or more subscriber terminals 130. In one embodiment, the satellite 105 operates in a multi-beam mode, transmitting a number of narrow beams each directed at a different region of the earth, allowing for frequency re-use. With such a multibeam satellite 105, there may be any number of different signal switching configurations on the satellite, allowing signals from a single gateway 115 to be switched between different spot beams. In one embodiment, the satellite 105 may be configured as a “bent pipe” satellite, wherein the satellite may frequency convert the received carrier signals before retransmitting these signals to their destination, but otherwise perform little or no other processing on the contents of the signals. A variety of physical layer transmission modulation and coding techniques may be used by the satellite 105 in accordance with certain embodiments of the invention, including those defined with the DVB-S2 and WiMAX standards. For other embodiments a number of configurations are possible (e.g., using LEO satellites, or using a mesh network instead of a star network), as evident to those skilled in the art.

The service signals transmitted from the satellite 105 may be received by one or more subscriber terminals 130, via the respective subscriber antenna 125. In one embodiment, the antenna 125 and terminal 130 together comprise a very small aperture terminal (VSAT), with the antenna 125 measuring approximately 0.6 meters in diameter and having approximately 2 watts of power. In other embodiments, a variety of other types of antennas 125 may be used at the subscriber terminal 130 to receive the signal from the satellite 105. The link 150 from the satellite 105 to the subscriber terminals 130 may be referred to hereinafter as the downstream downlink 150. Each of the subscriber terminals 130 may comprise a single user terminal or, alternatively, comprise a hub or router (not pictured) that is coupled to multiple user terminals. Each subscriber terminal 130 may be connected to consumer premises equipment (CPE) 160 comprising, for example computers, local area networks, Internet appliances, wireless networks, etc.

In one embodiment, a Multi-Frequency Time-Division Multiple Access (MF-TDMA) scheme is used for upstream links 140, 145, allowing efficient streaming of traffic while maintaining flexibility in allocating capacity among each of the subscriber terminals 130. In this embodiment, a number of frequency channels are allocated which may be fixed, or which may be allocated in a more dynamic fashion. A Time Division Multiple Access (TDMA) scheme is also employed in each frequency channel. In this scheme, each frequency channel may be divided into several timeslots that can be assigned to a connection (i.e., a subscriber terminal 130). In other embodiments, one or more of the upstream links 140, 145 may be configured with other schemes, such as Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Code Division Multiple Access (CDMA), or any number of hybrid or other schemes known in the art.

A subscriber terminal, for example 130-a, may transmit data and information to a network 120 destination via the satellite 105. The subscriber terminal 130 transmits the signals via the upstream uplink 145-a to the satellite 105 using the antenna 125-a. A subscriber terminal 130 may transmit the signals according to a variety of physical layer transmission modulation and coding techniques, including those defined with the DVB-S2 and WiMAX standards. In various embodiments, the physical layer techniques may be the same for each of the links 135, 140, 145, 150, or may be different. The link from the satellite 105 to the gateway 115 may be referred to hereinafter as the upstream downlink 140.

Turning to FIG. 1B, a block diagram is shown illustrating an alternative embodiment of a satellite communication system 100. This communication system 100 may, for example, comprise the system 100 of FIG. 1A, but is in this instance described with greater particularity. In this embodiment, the gateway 115 includes a Satellite Modem Termination System (SMTS), which is based at least in part on the Data-Over-Cable Service Interface Standard (DOCSIS). The SMTS in this embodiment includes a bank of modulators and demodulators for transmitting signals to and receiving signals from subscriber terminals 130. The SMTS in the gateway 115 performs the real-time scheduling of the signal traffic through the satellite 105, and provides the interfaces for the connection to the network 120.

In this embodiment, the subscriber terminals 135 use portions of DOCSIS-based modem circuitry, as well. Therefore, DOCSIS-based resource management, protocols, and schedulers may be used by the SMTS for efficient provisioning of messages. DOCSIS-based components may be modified, in various embodiments, to be adapted for use therein. Thus, certain embodiments may utilize certain parts of the DOCSIS specifications, while customizing others.

While a satellite communications system 100 applicable to various embodiments of the invention is broadly set forth above, a particular embodiment of such a system 100 will now be described. In this particular example, approximately 2 gigahertz (GHz) of bandwidth is to be used, comprising four 500 megahertz (MHz) bands of contiguous spectrum. Employment of dual-circular polarization results in usable frequency comprising eight 500 MHz non-overlapping bands with 4 GHz of total usable bandwidth. This particular embodiment employs a multi-beam satellite 105 with physical separation between the gateways 115 and subscriber spot beams, and configured to permit reuse of the frequency on the various links 135, 140, 145, 150. A single Traveling Wave Tube Amplifier (TWTA) is used for each service link spot beam on the downstream downlink, and each TWTA is operated at full saturation for maximum efficiency. A single wideband carrier signal, for example using one of the 500 MHz bands of frequency in its entirety, fills the entire bandwidth of the TWTA, thus allowing a minimum number of space hardware elements. Spotbeam size and TWTA power may be optimized to achieve maximum flux density on the earth's surface of −118 decibel-watts per meter squared per megahertz (dbW/m²/MHz). Thus, using approximately 2 bits per second per hertz (bits/s/Hz), there is approximately 1 Gbps of available bandwidth per spot beam.

With reference to FIG. 12A, an embodiment of a forward link distribution system 1200 is shown. The gateway 115 is shown coupled to an antenna 110, which generates four downstream signals. A single carrier with 500 MHz of spectrum is used for each of the four downstream uplinks 135. In this embodiment, a total of two-frequencies and two polarizations allow four separate downstream uplinks 135 while using only 1 GHz of the spectrum. For example, link A 135-A could be Freq 1 U (27.5-28.0 GHz) with left-hand polarization, link B 135-B could be Freq 1 U (27.5-28.0) GHz with right-hand polarization, link C could be Freq 2 U (29.5-30 GHz) with left-hand polarization, and link D could be Freq 2 U (29.5-30 GHz) with left-hand polarization.

The satellite 105 is functionally depicted as four “bent pipe” connections between a feeder and service link. Carrier signals can be changed through the satellite 105 “bent pipe” connections along with the orientation of polarization. The satellite 105 converts each downstream uplink 135 signal into a downstream downlink signal 150.

In this embodiment, there are four downstream downlinks 150 that each provides a service link for four spot beams 205. The downstream downlink 150 may change frequency in the bent pipe as is the case in this embodiment. For example, downstream uplink A 135-A changes from a first frequency (i.e., Freq 1 U) to a second frequency (i.e., Freq 1D) through the satellite 105. Other embodiments may also change polarization between the uplink and downlink for a given downstream channel. Some embodiments may use the same polarization and/or frequency for both the uplink and downlink for a given downstream channel.

Referring next to FIG. 12B, an embodiment of a return link distribution system is shown. This embodiment shows four upstream uplinks 145 from four sets of subscriber terminals 125. A “bent pipe” satellite 105 takes the upstream uplinks 145, optionally changes carrier frequency and/or polarization (not shown), and then redirects them as upstream downlinks 140 to a spot beam for a gateway 115. In this embodiment, the carrier frequency changes between the uplink 145 and the downlink 140, but the polarization remains the same. Because the feeder spot beams to the gateway 115 is not in the coverage area of the service beams, the same frequency pairs may be reused for both service links and feeder links.

Turning to FIGS. 2A and 2B, examples of a multi-beam system 200 configured according to various embodiments of the invention are shown. The multi-beam system 200 may, for example, be implemented in the network 100 described in FIGS. 1A and 1B. Shown are the coverage of a number of feeder and service spot beam regions 225, 205. In this embodiment, a satellite 215 reuses frequency bands by isolating antenna directivity to certain regions of a country (e.g., United States, Canada or Brazil). As shown in FIG. 2A, there is complete geographic exclusivity between the feeder and service spot beams 205, 225. But that is not the case for FIG. 2B where there may in some instances be service spot beam overlap (e.g., 205-c, 205-d, 205-e), while there is no overlap in other areas. However, with overlap, there are certain interference issues that may inhibit frequency band re-use in the overlapping regions. A four color pattern allows avoiding interference even where there is some overlap between neighboring service beams 205.

In this embodiment, the gateway terminals 210 are also shown along with their feeder beams 225. As shown in FIG. 2B, the gateway terminals 210 may be located in a region covered by a service spotbeam (e.g., the first, second and fourth gateways 210-1, 210-2, 210-4). However, a gateway may also be located outside of a region covered by a service spotbeam (e.g., the third gateway 210-3). By locating gateway terminals 210 outside of the service spotbeam regions (e.g., the third gateway 210-3), geographic separation is achieved to allow for re-use of the allocated frequencies.

There are often spare gateway terminals 210 in a given feeder spot beam 225. The spare gateway terminal 210-5 can substitute for the primary gateway terminal 210-4 should the primary gateway terminal 210-4 fail to function properly. Additionally, the spare can be used when the primary is impaired by weather.

Referring next to FIG. 8, an embodiment of a downstream channel 800 is shown. The downstream channel 800 includes a series of superframes 804 in succession, where each superframe 804 may have the same size or may vary in size. This embodiment divides a superframe 804 into a number of virtual channels 808(1-n). The virtual channels 808(1-n) in each superframe 804 can be the same size or different sizes. The size of the virtual channels 808(1-n) can change between different superframes 804. Different coding can be optionally used for the various virtual channels 808 (1-n). In some embodiments, the virtual channels are as short as one symbol in duration.

With reference to FIG. 9, an embodiment of an upstream channel 900 is shown. This embodiment uses MF-TDMA, but other embodiments can use CDMA, OFDM, or other access schemes. The upstream channel 900 has 500 MHz of total bandwidth in one embodiment. The total bandwidth is divided into m frequency sub-channels, which may differ in bandwidth, modulation, coding, etc. and may also vary in time based on system needs.

In this embodiment, each subscriber terminal 130 is given a two-dimensional (2D) map to use for its upstream traffic. The 2D map has a number of entries where each indicates a frequency sub-channel 912 and time segment 908(1-5). For example, one subscriber terminal 130 is allocated sub-channel m 912-m, time segment one 908-1; sub-channel two 912-2, time segment two 908-2; sub-channel two 912-2, time segment three 908-3; etc. The 2D map is dynamically adjusted for each subscriber terminal 130 according to anticipated need by a scheduler in the SMTS.

Referring to FIG. 13, an embodiment of a channel diagram is shown. Only the channels for a single feeder spot beam 225 and a single service spot beam 205 are shown, but embodiments include many of each spot beam 225, 205 (e.g., various embodiments could have 60, 80, 100, 120, etc. of each type of spot beam 225, 205). The forward channel 800 includes n virtual channels 808 traveling from the gateway antenna 110 to the service spot beam 205. Each subscriber terminal 130 may be allocated one or more of the virtual channels 808. m MF-TDMA channels 912 make up the return channel 900 between the subscriber terminal (ST) antennas 125 and the feeder spot beam 225.

Referring next to FIG. 3, an embodiment of a ground system 300 of gateways 115 is shown in block diagram form. One embodiment could have fifteen active gateways 115 (and possibly spares) to generate sixty service spot beams, for example. The ground system 300 includes a number of gateways 115 respectively coupled to antennas 110. All the gateways 115 are coupled to a network 120 such as the Internet. The network is used to gather information for the subscriber terminals. Additionally, each SMTS communicates with other SMTS and the Internet using the network 120 or other means not shown.

Each gateway 115 includes a transceiver 305, a SMTS 310 and a router 325. The transceiver 305 includes both a transmitter and a receiver. In this embodiment, the transmitter takes a baseband signal and upconverts and amplifies the baseband signal for transmission of the downstream uplinks 135 with the antenna 110. The receiver downconverts and tunes the upstream downlinks 140 along with other processing as explained below. The SMTS 310 processes signals to allow the subscriber terminals to request and receive information and schedules bandwidth for the forward and return channels 800, 900. Additionally, the SMTS 310 provides configuration information and receives status from the subscriber terminals 130. Any requested or returned information is forwarded via the router 325.

With reference to FIG. 11, an embodiment of gateway receiver 1100 is shown. This embodiment of the receiver 1100 processes four return channels 900 from four different service spot beams 205. The return channels 900 may be divided among four pathways using antenna polarization and/or filtering 1104. Each return channel is coupled to a low-noise amplifier (LNA) 1108. Down conversion 1112 mixes down the signal into its intermediate frequency. Each of the upstream sub-channels 912 is separated from the signal by a number of tuners 1116. Further processing is performed in the SMTS 310.

Referring next to FIG. 10, an embodiment of a gateway transmitter 1000 is shown. The downstream channels 800 are received at their intermediate frequencies from the SMTS 310. With separate pathways, each downstream channel 800 is up-converted 1004 using two different carrier frequencies. A power amplifier 1008 increases the amplitude of the forward channel 900 before coupling to the antenna 110. The antenna 110 polarizes the separate signals to keep the four forward channels 800 distinct as they are passed to the satellite 105.

With reference to FIG. 4, an embodiment of a SMTS 310 is shown in block diagram form. Baseband processing is done for the inbound and outbound links 135, 140 by a number of geographically separated gateways 115. Each SMTS 310 is generally divided into two sections, specifically, the downstream portion 305 to send information to the satellite 105 and the upstream portion 315 to receive information from the satellite 105.

The downstream portion 305 takes information from the switching fabric 416 through a number of downstream (DS) blades 412. The DS blades 412 are divided among a number of downstream generators 408. This embodiment includes four downstream generators 408, with one for each of the downstream channels 800. For example, this embodiment uses four separate 500 MHz spectrum ranges having different frequencies and/or polarizations. A four-color modulator 436 has a modulator for each respective DS generator 408. The modulated signals are coupled to the transmitter portion 1000 of the transceiver 305 at an intermediate frequency. Each of the four downstream generators 408 in this embodiment has J virtual DS blades 412.

The upstream portion 315 of the SMTS 310 receives and processes information from the satellite 105 in the baseband intermediate frequency. After the receiver portion 1100 of the transceiver 305 produces all the sub-channels 912 for the four separate baseband upstream signals, each sub-channel 912 is coupled to a different demodulator 428. Some embodiments could include a switch before the demodulators 428 to allow any return link sub-channel 912 to go to any demodulator 428 to allow dynamic reassignment between the four return channels 908. A number of demodulators are dedicated to an upstream (US) blade 424.

The US blades 424 serve to recover the information received from the satellite 105 before providing it to the switching fabric 416. The US scheduler 430 on each US blade 424 serves to schedule use of the return channel 900 for each subscriber terminal 130. Future needs for the subscriber terminals 130 of a particular return channel 900 can be assessed and bandwidth/latency adjusted accordingly in cooperation with the Resource Manager and Load Balancer (RM/LB) block 420.

The RM/LB block 420 assigns traffic among the US and DS blades. By communication with other RM/LB blocks 420 in other SMTSes 310, each RM/LB block 420 can reassign subscriber terminals 130 and channels 800, 900 to other gateways 115. This reassignment can take place for any number of reasons, for example, lack of resources and/or loading concerns. In this embodiment, the decisions are done in a distributed fashion among the RM/LB blocks 420, but other embodiments could have decisions made by one master MR/LB block or at some other central decision-making authority. Reassignment of subscriber terminals 130 could use overlapping service spot beams 205, for example.

Referring next to FIG. 5, an embodiment of a satellite 105 is shown in block diagram form. The satellite 105 in this embodiment communicates with fifteen gateways 115 and all STs 130 using sixty feeder and service spot beams 225, 205. Other embodiments could use more or less gateways/spot beams. Buss power 512 is supplied using a power source such as chemical fuel, nuclear fuel and/or solar energy. A satellite controller 516 is used to maintain attitude and otherwise control the satellite 105. Software updates to the satellite 105 can be uploaded from the gateway 115 and performed by the satellite controller 516.

Information passes in two directions through the satellite 105. A downstream translator 508 receives information from the fifteen gateways 115 for relay to subscriber terminals 130 using sixty service spot beams 205. An upstream translator 504 receives information from the subscriber terminals 130 occupying the sixty spot beam areas and relays that information to the fifteen gateways 115. This embodiment of the satellite can switch carrier frequencies in the downstream or upstream processors 508, 504 in a “bent-pipe” configuration, but other embodiments could do baseband switching between the various forward and return channels 800, 900. The frequencies and polarization for each spot beam 225, 205 could be programmable or preconfigured.

With reference to FIG. 6A, an embodiment of an upstream translator 504 is shown in block diagram form. A Receiver and Downconverter (Rx/DC) block 616 receives all the return link information for the area defined by a spot beam 205 as an analog signal before conversion to an intermediate frequency (IF). There is a Rx/DC block 616 for each service spot beam area 205. An IF switch 612 routes a particular baseband signal from a Rx/DC block 616 to a particular upstream downlink channel. The upstream downlink channel is filled using an Upconverter and Traveling Wave Tube Amplifier (UC/TWTA) block 620. The frequency and/or polarization can be changed through this process such that each upstream channel passes through the satellite 105 in a bent pipe fashion.

Each gateway 115 has four dedicated UC/TWTA blocks 620 in the upstream translator 504. Two of the four dedicated UC/TWTA blocks 620 operate at a first frequency range and two operate at a second frequency range in this embodiment. Additionally, two use right-hand polarization and two use left-hand polarization. Between the two polarizations and two frequencies, the satellite 105 can communicate with each gateway 115 with four separate upstream downlink channels.

Referring next to FIG. 6B, an embodiment of a downstream translator 508 is shown as a block diagram. Each gateway 115 has four downstream uplink channels to the satellite 105 by use of two frequency ranges and two polarizations. A Rx/DC block 636 takes the analog signal and converts the signal to an intermediate frequency. There is a Rx/DC block 636 for all sixty downstream uplink channels from the fifteen gateways 115. The IF switch 612 connects a particular channel 800 from a gateway 115 to a particular service spot beam 205. Each IF signal from the switch 628 is modulated and amplified with a UC/TWTA block 632. An antenna broadcasts the signal using a spot beam to subscriber terminals 130 that occupy the area of the spot beam. Just as with the upstream translator 504, the downstream translator 508 can change carrier frequency and polarization of a particular downstream channel in a bent-pipe fashion.

FIG. 7 comprises a block diagram illustrating a set of subscriber equipment 700 which may be located at a subscriber location for the reception and transmission of communication signals. Components of this set of subscriber equipment 700 may, for example, comprise the antenna 125, associated subscriber terminal 130 and any consumer premises equipment (CPE) 160, which may be a computer, a network, etc.

An antenna 125 may receive signals from a satellite 105. The antenna 125 may comprise a VSAT antenna, or any of a variety other antenna types (e.g., other parabolic antennas, microstrip antennas, or helical antennas). In some embodiments, the antenna 125 may be configured to dynamically modify its configuration to better receive signals at certain frequency ranges or from certain locations. From the antenna 125, the signals are forwarded (perhaps after some form of processing) to the subscriber terminal 130. The subscriber terminal 130 may include a radio frequency (RF) frontend 705, a controller 715, a virtual channel filter 702, a modulator 725, a demodulator 710, a filter 706, a downstream protocol converter 718, an upstream protocol converter 722, a receive (Rx) buffer 712, and a transmit (Tx) buffer 716.

In this embodiment, the RF frontend 705 has both transmit and receive functions. The receive function includes amplification of the received signals (e.g., with a low noise amplifier (LNA)). This amplified signal is then downconverted (e.g., using a mixer to combine it with a signal from a local oscillator (LO)). This downconverted signal may be amplified again with the RF frontend 705, before processing of the superframe 804 with the virtual channel filter 702. A subset of each superframe 804 is culled from the downstream channel 800 by the virtual channel filter 702, for example, one or more virtual channels 808 are filtered off for further processing.

A variety of modulation and coding techniques may be used at the subscriber terminal 130 for signals received from and transmitted to a satellite. In this embodiment, modulation techniques include BPSK, QPSK, 8PSK, 16APSK, 32PSK. In other embodiments, additional modulation techniques may include ASK, FSK, MFSK, and QAM, as well as a variety of analog techniques. The demodulator 710 may demodulate the down-converted signals, forwarding the demodulated virtual channel 808 to a filter 706 to strip out the data intended for the particular subscriber terminal 130 from other information in the virtual channel 808.

Once the information destined for the particular subscriber terminal 130 is isolated, a downstream protocol converter 718 translates the protocol used for the satellite link into one that the DOCSIS MAC block 726 uses. Alternative embodiments could use a WiMAX MAC block or a combination DOCSIS/WiMAX block. A Rx buffer 712 is used to convert the high-speed received burst into a lower-speed stream that the DOCSIS MAC block 726 can process. The DOCSIS MAC block 726 is a circuit that receives a DOCSIS stream and manages it for the CPE 160. Tasks such as provisioning, bandwidth management, access control, quality of service, etc. are managed by the DOCSIS MAC block 726. The CPE can often interface with the DOCSIS MAC block 726 using Ethernet, WiFi, USB and/or other standard interfaces. In some embodiments, a WiMax block 726 could be used instead of a DOCSIS MAC block 726 to allow use of the WiMax protocol.

It is also worth noting that while a downstream protocol converter 718 and upstream protocol converter 722 may be used to convert received packets to DOCSIS or WiMax compatible frames for processing by a MAC block 726, these converters will not be necessary in many embodiments. For example, in embodiments where DOCSIS or WiMax based components are not used, the protocol used for the satellite link may also be compatible with the MAC block 726 without such conversions, and the converters 718, 722 may therefore be excluded.

Various functions of the subscriber terminal 130 are managed by the controller 715. The controller 715 may oversee a variety of decoding, interleaving, decryption, and unscrambling techniques, as known in the art. The controller may also manage the functions applicable to the signals and exchange of processed data with one or more CPEs 160. The CPE 160 may comprise one or more user terminals, such as personal computers, laptops, or any other computing devices as known in the art.

The controller 715, along with the other components of the subscriber terminal 130, may be implemented in one or more Application Specific Integrated Circuits (ASICs), or a general purpose processor adapted to perform the applicable functions. Alternatively, the functions of the subscriber terminal 130 may be performed by one or more other processing units (or cores), on one or more integrated circuits. In other embodiments, other types of integrated circuits may be used (e.g., Structured/Platform ASICs, Field Programmable Gate Arrays (FPGAs) and other Semi-Custom ICs), which may be programmed in any manner known in the art. The controller may be programmed to access memory unit (not shown). It may fetch instructions and other data from the memory unit, or write data to the memory-unit.

As noted above, data may also be transmitted from the CPE 160 through the subscriber terminal 130 and up to a satellite 105 in various communication signals. The CPE 160, therefore, may transmit data to DOCSIS MAC block 726 for conversion to the DOCSIS protocol before that protocol is translated with an upstream protocol converter 722. The slow-rate data waits in the Tx buffer 716 until it is burst over the satellite link.

The processed data is then transmitted from the Tx buffer 716 to the modulator 725, where it is modulated using one of the techniques described above. In some embodiments, adaptive or variable coding and modulation techniques may be used in these transmissions. Specifically, different modulation and coding combinations, or “modcodes,” may be used for different packets, depending on the signal quality metrics from the antenna 125 to the satellite 105. Other factors, such as network and satellite congestion issues, may be factored into the determination, as well. Signal quality information may be received from the satellite or other sources, and various decisions regarding modcode applicability may be made locally at the controller, or remotely. The RF frontend 705 may then amplify and upconvert the modulated signals for transmission through the antenna 125 to the satellite.

Large Packet Concatenation

Large packet concatenation refers to the function performed at the user SM whereby data packets arriving at the software queue are concatenated to form a large frame. The large frame in a specific embodiment is up to either 3854 bytes (which is 255 mini-slots maximum size) or 64 Ethernet packets. The process stops concatenating when either limit for the large frame is hit.

In DAMA, according to the invention, bandwidth allocation requests, whether contention requests or piggyback requests are made at most once per round-trip time (RTT). A request is generated in accordance with known protocols. For example, the standard DOCSIS mechanism can be used to generate the requests.

The system has a queuing architecture that consists of a hardware queue (HWQ) and a software queue (SWQ) in tandem, with the SWQ in front. The minimum size of the HWQ is two (2) packet descriptors deep. The firmware allows for concatenating packets that are in the SWQ. If N packets arrive in a burst, a burst being defined as a leading packet (p0) and N−1 packets arriving within a round-trip transit time RTT of p0, then p0 and p1 will not be concatenated. However, p2 through pN−1 will be concatenated into cp2. The burst can then be looked upon as a burst of size 3, {p0, p1, cp2}. The packet p0 will experience a delay of 1.5×RTT, p1 will experience a delay of up to 2.5×RTT, and all the packets that make of cp2 will experience a delay of up to 3.5×RTT.

DAMA and its variants are potentially useful to this end because DAMA is perfectly efficient, except for the collisions in the contention channel. When the arrival process of packets is not deterministic, it allows for a perfectly utilized channel. When the arrival process is deterministic, like the case of a constant bit rate voice stream, a scheme such as TDMA can also achieve perfect efficiency. The Achilles heel of DAMA is its packet latency. There is an irreducible 1.5×RTT delay for all packets, and therefore when the arrival process is bursty with respect to the RTT, packets that occupy positions 1 through N−1 in a burst of size N will also suffer a wait time. To improve the performance of DAMA, the wait time must be minimized.

The state of the output queue immediately after the arrival of the i^(th) packet, p_(i), is S_(i). If piggybacking is employed, then, defining the departure time of the packet in position 0 of the output queue to be T_(D), the piggybacked information on the departing packet should be S_(j), where T_(j), the arrival time of the j^(th) packet, is the last arrival time before T_(D). This gives the scheduler the most up-to-date status of the terminal's output queue.

In accordance with the invention, a proprietary type length value (TLV) can be added to each outgoing packet that describes the state S_(j). This would allow the scheduler to ignore the default piggybacked request in favor of one which provides a fuller picture of the bandwidth needs of the terminal. In the event that the arrival process in not bursty on time scales of the RTT, then the proprietary TLV will be identical to the default piggybacked request. When the arrival process is bursty, then the state contained in the TLV will provide a quick picture of the backlog at the terminal and hence minimize the wait times of non-first packets without any reduction in efficiency. The preceding methodology assumes that a packet can have its TLV updated at any instant prior to transmission.

The architecture of the typical exemplary modem prohibits access to packets once they have been placed into the queue HWQ, typically a hardware queue. In order for hardware generated piggybacking to work, the minimum depth of the HWQ is two. This means that if a proprietary TLV is used, it will not reflect the state of the terminal when transmitted but rather will reflect the state of the terminal when it was placed into the HWQ. When the state transmitted to the scheduler is not the most current, the packets waiting for transmission will suffer an increase in wait time.

The preceding discussion can be summarized as follows.

-   -   1. DAMA, ignoring the random channel, is maximally efficient     -   2. There is an irreducible packet delay of 1.5×RTT since every         packet must be requested     -   3. Burst arrivals can benefit from piggybacking to reduce         loading on the random channel     -   4. Communicating the total state of the terminal, rather than         the size of the next packet when piggybacking, minimizes the         wait time without impacting efficiency     -   5. Allowing for updates to the piggybacked state up to the point         of packet transmission minimizes the packet wait time without         impacting efficiency     -   6. Not allowing for updates to the piggybacked state up to the         point of packet transmission will unnecessarily increase the         packet wait time

Thus in accordance with the invention, the performance of Web browsing is improved relative to the prior art by pre-allocation. Pre-allocation means that the scheduler allocates bandwidth without being explicitly asked by the terminal. This can take many forms. Almost all forms of pre-allocation will result in a reduction in efficiency. However, almost all forms of pre-allocation result in a reduced wait time, and in some instances can result in a delay that is lower than the 1.5×RTT lower bound. Hence, a modification to the conventional DAMA protocol by which pre-allocation is applied is a departure from conventional DAMA.

Therefore, according to the invention, pre-allocation is implemented by a new type of piggyback request which asks for bandwidth for the next concatenated packet. Since it is desirable to concatenate all packets that arrive at the user SM since the last piggyback request, the piggyback request according to the invention covers all currently known packets in the SM. There are a few times when 3854 bits does not cover the known packets, in which case a storage buffer must be used or a mechanism must be used to repeat dropped packets.

Event Driven State Machine

Referring to FIG. 14, the Event Driven State Machine (ESM) provides instruction for how the user SM should act given that an event has occurred. There are four different events.

-   -   1. UDC Timer expiry     -   2. PDU arrival to the SWQ     -   3. A frame packet descriptor is reclaimed     -   4. A MAP with grants arrives

The ESM is shown in FIG. 14. This state machine supports upfront delayed concatenation (UDC), as well as other functions

The (concatenated) frame that sits at the head of the SWQ is referred to as “cp2”.

The actions upon UDC timer expiry are evident from FIG. 14.

When a PDU arrives, it either is concatenated into an existing frame or becomes the first packet of a new concatenation group.

When a packet descriptor is reclaimed, the user SM will take Actions A through C. When the function ReclaimTxFrames( ) is executed, this represents either the conclusion of a transmitted frame or frame fragment. When ReclaimTxFrames( ) is executed, the VQ is updated if a (concatenated) frame is known to have completed transmission. This design makes no assumptions about the nature of ReclaimTxFrames( ). If it is called each time a fragment is transmitted, rather than the entire (concatenated) frame, the state machine of FIG. 14 will still function properly.

When a MAP arrives with a grant, the actions are a bit more involved and are explained hereinafter below.

The Virtual Queue for Software Accounting

A notion of Virtual Queue (VQ) is introduced to serve as a repository for accounting. When a (concatenated) frame is dumped from the SWQ to the HWQ, its size in bytes is logged as an entry in the VQ.

A VQ entry will take the abstract form: <Frame Id>, <Bytes Remaining>, <Fragmented Flag>, <Done Flag>, <HWQ Empty Upon Dump Flag>, <Phantom Packet Flag>, and <Final Frame Flag>. For the purposes of description, an entry takes the following structure.

struct VQEntry { list_of_frameIds bytesRemaining fragmentedFlag doneFlag heudFlag p2Flag finalFrameFlag }

When a (concatenated) frame is dumped from the SWQ to the HWQ, the VQEntry.bytesRemaining value is the total length (total_len) of the frame if un-concatenated or the concatenated length (concat_len) if the frame is a concatenated frame.

The field VQEntry.list of frameIds must be selected to represent the entire frame. When the function ReclaimTxFrames( ) executes, packet descriptors and buffer descriptors are reclaimed for SW use. When a (concatenated) frame is fully transmitted (i.e. no more fragments remain in the HWQ), then the entry at the head of the VQ will be purged. The entry can be purged when all packets in the list_of_frameIds have been reclaimed.

The fragmented flag is set to TRUE if the (concatenated) frame under goes fragmentation over the course of its transmission.

The done flag represents the SW's understanding of progress in the hardware queue.

The heudFlag field is set to TRUE if the (concatenated) frame which is represented by this VQ entry was placed into an empty hardware queue (heud=Hardware queue Empty Upon Dump). This field indicates that not only will this (concatenated) frame submit a request to the random channel, but that it should not have a phantom packet placed in the HWQ behind it.

The p2Flag field is set to TRUE in the VQ entry if the frame which is being dumped to the SWQ is in fact a Phantom Packet (P²). For all other frames, this is set to FALSE.

The finalFrameFlag field is set to TRUE in the VQ entry if the frame being dumped is being dumped due to a grant which is the last grant in a series of grants. Typically this flag is only set for Phantom Packets. This is described in more detail hereinafter below.

The depth of the VQ is driven by the needs of bulk transfer. Assuming that the concatenation limit is ˜4000 bytes and that the upstream rate is 512 Kb/s. This corresponds to a XTP transmit window of 62,400 bytes (650 milliseconds*512 Kb/s*1.5/8). If this value is divided by 4000, this makes for 16 concatenated frames, therefore the VQ must have at least 16-20 entries.

Grant Processing Flow

When MAPs arrive at the SM, both the hardware and software parse through them. When a MAP arrives, the software must perform pre-processing to make a tuple <grantSizeInBytes, lastGrantFlag>. A grant tuple has lastGrantFlag set to TRUE if it is the last grant allocated to a particular terminal in the MAP and there are no “Grants Pending” for this terminal. Otherwise it is set to FALSE.

Once all the grants in the MAP that are assigned to a particular user SM are arranged as an array of tuples, then the flowchart of FIGS. 15A, 15B, 15C can be executed for each grant tuple.

This flow chart supports MTD, PAv2, and BToDAMA.

When a grant arrives, it is inspected to determine if the S-HoQ frame is to be dumped from the SWQ to the HWQ. This is the standard MTD behavior. Pre-allocation (both Web triggered and bulk) adds an additional requirement to limit random channel over usage. This additional requirement is the “Phantom Packet”. The Phantom Packet is dumped from the SWQ to the HWQ when an arriving series of grants will not only empty the HWQ but also empty the SWQ. The Phantom Packet (P²) is a frame that will be discarded by the SMTS and will fit into a single turbo code word (33-35 bytes). Phantom Packets will be inserted for all otherwise unusable grants. Phantom Packets will be used in both PAv2 and BToDAMA to keep the DAMA channel active and out of the random channel. If a source goes silent, Phantom Packets will no longer be inserted. The Phantom Packet is an upstream MAC Management message with an ID of 252.

All Phantom Packets must carry the pTLV. All updates to the pTLV should be done before a dump event (either a concatenated frame dump event or a P² dump event).

Requirements at the Dump Event

(Concatenated) frames will be dumped from the SWQ to the HWQ because either a UDC timer expired, a concat threshold was reached, or a grant arrived that triggered the dump.

For all of these cases, if the appState (of the ASM) is set to BULK, the buffer occupancy of the HWQ must be inspected. If the HWQ is empty, then a counter that is SID specific (i.e. global across all frames within the SID) name HWQEmptyCounter is incremented. If the HWQ is not empty, then this global variable remains unchanged. Every N_(D) dump events, upon the conclusion of the dump, this global variable is inspected. If the HWQEmptyCounter is greater than or equal to a threshold (currently 2), increase the paMultiplier field of the pTLV by I_(M). Either way, the HWQEmptyCounter is reset to 0.

The increment of the multiplier is meant to increase the upstream grant rate. Ideally, for each N_(D), the scheduler preferably allocates enough grants to carry one additional concatenated frame per RTT. The increment I_(M) is set based upon the average size of a MTD frame divided by the paQuanta value. To simplify the design, I_(M) is set to be the concatenation threshold divided by the value paQuanta. This is not completely accurate as some concatenated frames will be much below the concatenation threshold; however it eliminates the need for computing the average concatenated frame size on the fly.

Error! Objects Cannot be Created from Editing Field Codes.

Equation 1

The paMultiplier has a limit placed on it to increase efficiency. This limit allows a backlog to be maintained when transferring at near CoS, so that no more grants than are required are made.

When Phantom Packets are dumped, the opposite effect is desired. Dumping Phantom Packets implies that the queues are empty and that the modem is not using all the grants that are being granted. It is desired that the bandwidth be ramped down somewhat slower than it is ramped up; therefore the decrement value, D_(M), will be a scaled version of I_(M).

Error! Objects Cannot be Created from Editing Field Codes.

Equation 2

For each and every P² inserted, paMultiplier shall be decreased by D_(M). The paMultiplier will never go below zero.

pTLV Generation and Update

The pTLV is populated and added to the EHDR on the leading frame of a concatenated frame, or to every frame if that is easier. The pTLV will change somewhat slowly with time, depending upon the application (BULK faster than WEB). When the application is WEB, the paQuanta value will change with each update to the windowing algorithm (if windowing is used). When the application is BULK, the paQuanta value will remain fixed however the multiplier will change each time a Phantom Packet is inserted, or when the N_(D) ^(th) frame is dumped into a non-empty HWQ.

Web pTLV Generation and Update

When requesting WEB pre-allocation, the user SM will use a static value of paQuanta in the range of 1250 to 3864 bytes, converted to quanta units.

Bulk Transfer pTLV Generation and Update

The pTLV will have paQuanta_(BULK) set to a fixed size. For the purposes of initial integration, this size is 276 bytes (converted to quanta units). When sizing paQuanta for BULK, there is a tradeoff between making the grants large (to potentially carry a large frame efficiently) and making them small (in the event that a frame is just slightly larger than paQuanta, the following paQuanta grant is used to inefficiently carry the fragment). It is the author's intuition that smaller grants are better.

In order to achieve speeds closer to CoS on small files, the paMultiplier for BULK pre-allocation will begin at the limit and ramp down (if necessary) to the correct rate. This feature is known as “Jump to CoS.” Under normal conditions, this will only wastebandwidth when there is a non-congestion speed limiting factor (e.g., an FTP server limit).

Fair-Sharing and Class-of-Service

Minimum Reserved Rate

The original Best Effort scheduler algorithm in the STMS software has provisions for utilizing the DOCSIS parameter Minimum Reserved Rate. This is defined as follows:

This parameter specifies the minimum rate, in bits/sec, reserved for this Service Flow. The CMTS should be able to satisfy bandwidth allocation requests for a Service Flow up to its Minimum Reserved Traffic Rate. If less bandwidth than its Minimum Reserved Traffic Rate is requested for a Service Flow, the CMTS may reallocate the excess reserved bandwidth for other purposes. The aggregate Minimum Reserved Traffic Rate of all Service Flows may exceed the amount of available bandwidth. This value of this parameter is calculated from the byte following the MAC header HCS to the end of the CRC5. If this parameter is omitted, then it defaults to a value of 0 bits/sec (i.e., no bandwidth is reserved for the flow by default)

The Best Effort algorithm utilizes a normalized version of this parameter (in kilobytes) to compute the credits accumulated by a grant in each pass through the DRR algorithm. Therefore, this parameter can be varied according to class-of-service for a flow to give a relative weighting versus other flows on the channel.

It should be noted that the systems, methods, and software discussed above are intended merely to be exemplary in nature. It must be stressed that various embodiments may omit, substitute, or add various procedures or components as appropriate. For instance, it should be appreciated that in alternative embodiments, the methods may be performed in an order different than that described, and that various steps may be added, omitted or combined. Also, features described with respect to certain embodiments may be combined in various other embodiments. Different aspects and elements of the embodiments may be combined in a similar manner. Also, it should be emphasized that technology evolves and, thus, many of the elements are exemplary in nature and should not be interpreted to limit the scope of the invention.

Specific details are given in the description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, well-known circuits, processes, algorithms, structures, and techniques have been shown without unnecessary detail in order to avoid obscuring the embodiments.

Also, it is noted that the embodiments may be described as a process which is depicted as a flow chart, a structure diagram, or a block diagram. Although they may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed, but could have additional steps not included in the figure.

Moreover, as disclosed herein, the terms “storage medium” or “storage device” may represent one or more devices for storing data, including read only memory (ROM), random access memory (RAM), magnetic RAM, core memory, magnetic disk storage media, optical storage media, flash memory devices or other computer readable media for storing information. The term “computer-readable medium” includes, but is not limited to, portable or fixed storage devices, optical storage devices, wireless channels, a SIM card, other smart cards, and various other media capable of storing, containing or carrying instructions or data.

Furthermore, embodiments may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine readable medium such as a storage medium. Processors may perform the necessary tasks.

Having described several embodiments, it will be recognized by those of skill in the art that various modifications, alternative constructions, and equivalents may be used without departing from the spirit of the invention. For example, the above elements may merely be a component of a larger system, wherein other rules may take precedence over or otherwise modify the application of the invention. Also, a number of steps may be required before the above elements are considered. Accordingly, the above description should not be taken as limiting the scope of the invention, which is defined in the following claims. 

1. A method for scheduling upstream information arriving through a user terminal to a gateway in a satellite communication link, the method comprising: concatenating data packets arriving at a first queue at the user terminal to form a concatenated frame larger than a conventional frame for transmission; and issuing from the user terminal a piggyback request replacing a conventional DAMA contention request, to request bandwidth allocation for use by the concatenated frame during a subsequent communication cycle via the satellite link.
 2. The method according to claim 1, wherein said piggyback request covers a plurality of individual packets.
 3. The method according to claim 1 wherein said first queue is a software queue.
 4. The method according to claim 1 further including the step of, after issuing the piggyback request, dumping data packets from the first queue to a second queue.
 5. The method according to claim 4 wherein the first queue is a software queue and the second queue is a hardware queue.
 6. The method according to claim 4 further including logging the number of data packets dumped from the first queue to the second queue in a virtual queue.
 7. The method according to claim 6 wherein the virtual queue distinguishes between concatenated frames and unconcatenated frames and further including the step of clearing entries in the virtual queue as transmissions of concatenated frames and of unconcatenated frames are completed in order to free queue space in the first queue.
 8. The method of claim 1 further comprising: using a scheduler, responsive to the conventional DAMA contention request and to the piggyback request and located on the ground remote from the user terminal, to meter the upstream transmissions of the user terminal and a plurality of additional remote user terminals.
 9. A satellite user terminal for grouping packets arriving at a user terminal for transmission via a satellite communication link, the satellite user terminal comprising: a processor with at least one queue configured to concatenate a plurality of data packets arriving at said first queue at the user terminal to form a concatenated frame that is larger than a frame formed without concatenating data packets; and a transmitter, communicatively coupled to the processor, configured to issue a piggyback request via the satellite communication link that replaces a conventional DAMA contention request to request bandwidth allocation for a frame during a succeeding communication cycle.
 10. A satellite user terminal for grouping packets arriving at a user terminal for transmission via a satellite communication link, the satellite user terminal comprising: concatenating means for concatenating a plurality of data packets arriving at a first queue at the user terminal to form a concatenated frame that is larger than a frame formed without concatenating data packets; and issuing means, communicatively coupled to the first concatenating means, for issuing a piggyback request via the satellite communication link that replaces a conventional DAMA contention request to request bandwidth allocation for a frame during a succeeding communication cycle.
 11. A method for scheduling upstream packets arriving at a user terminal for transmission via a satellite communication link, the method comprising: receiving a plurality of data packets by a user terminal having a first queue; concatenating in the first queue a first subset of data packets from the plurality of data packets to form a plurality of concatenated packets in a concatenated frame, the concatenated frame being larger than a frame formed without concatenating data packets; issuing a piggyback request by the user terminal that replaces a conventional DAMA contention request issued by the user terminal to request bandwidth allocation for a concatenated frame during a succeeding communication cycle; and using the scheduler, in response to the piggyback request, to meter the upstream transmissions of the user terminal and a plurality of additional remote user terminals associated with the user terminal.
 12. A system for scheduling upstream information arriving through a user satellite modem to a gateway in a satellite communication link, wherein the system employs a conventional DAMA request at least in part to request bandwidth allocation, the system comprising: a processor for concatenating data packets arriving at a first queue at the users satellite modem to form a larger frame for transmission; and a transmitter for issuing a piggyback request to request bandwidth allocation for the succeeding concatenated frame via the satellite link to allow a scheduler to meter the upstream transmission of various associated said subscriber terminals.
 13. The system according to claim 12, wherein said piggyback request covers a plurality of individual packets up to a preselected limit.
 14. The system according to claim 12 further including a scheduler for scheduling the data requests.
 15. The system according to claim 14 wherein said scheduler is disposed at the gateway.
 16. The system according to claim 12 wherein said first queue is a software queue.
 17. The system according to claim 12 further including a second queue for receiving packets from the first queue.
 18. The system according to claim 17 wherein the first queue is a software queue and the second queue is a hardware queue. 